Closure Operators and Lattice Extensions

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Closure Operators and Lattice Extensions

For closure operators Γ and ∆ on the same set X, we say that ∆ is a weak (resp. strong) extension of Γ if Cl(X, Γ) is a complete meet-subsemilattice (resp. complete sublattice) of Cl(X, ∆). This context is used to describe describe the extensions of a finite lattice that preserve various properties.

متن کامل

Categories of lattice-valued closure (interior) operators and Alexandroff L-fuzzy topologies

Galois connection in category theory play an important role inestablish the relationships between different spatial structures. Inthis paper, we prove that there exist many interesting Galoisconnections between the category of Alexandroff $L$-fuzzytopological spaces, the category of reflexive $L$-fuzzyapproximation spaces and the category of Alexandroff $L$-fuzzyinterior (closure) spaces. This ...

متن کامل

On the Lattice of L-closure Operators

In 1965 L. A Zadeh [11] introduced fuzzy sets as a generalization of ordinary sets. After that C. L. Chang [2] introduced fuzzy topology and that led to the discussion of various aspects of L-topology by many authors. The Čech closure spaces introduced by Čech E. [1] is a generalization of the topological spaces. The theory of fuzzy closure spaces has been established by Mashhour and Ghanim [4]...

متن کامل

From torsion theories to closure operators and factorization systems

Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].

متن کامل

Closure Operators and Subalgebras

In this article we present several logical schemes. The scheme SubrelstrEx concerns a non empty relational structure A, a set B, and a unary predicate P, and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P[x] provided the following conditions are met: • P[B], • B ∈ the carrier of A. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Order

سال: 2004

ISSN: 0167-8094,1572-9273

DOI: 10.1007/s11083-004-5178-y